The Tile Packing Problem Ares Lagae Philip Dutr´e Department of Computer Science

Source URL: people.cs.kuleuven.be

Chapter 10 Bin Packing Here we consider the classical Bin Packing problem: We are given a set I = {1, . . . , n} of items, where item i ∈ I has size si ∈ (0, 1] and a set B = {1, . . . , n} of bins with capacity one

Source URL: www2.informatik.hu-berlin.de

• Computational complexity theory
• Theory of computation
• Complexity classes
• Packing problems
• NP-complete problems
• Bin packing problem
• Approximation algorithms
• Polynomial-time approximation scheme
• Partition problem
• NP
• NC
• Time complexity

Packing on the pounds Canine obesity is a big problem (no pun intended). Learn how to keep your dog slim and trim –

Source URL: sarajacksonwriter.com

Complexity of the Packing Coloring Problem of Trees∗ Jiˇr´ı Fiala† Petr A. Golovach‡

Source URL: iti.mff.cuni.cz

CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 On the d-Runaway Rectangle Escape Problem Aniket Basu Roy∗, Sathish Govindarajan∗, Neeldhara Misra∗, Shreyas Shetty∗ Abstract

Source URL: drona.csa.iisc.ernet.in

• Logic
• Quadrilaterals
• Rectangle
• Bin
• Algorithm
• Special case
• R-tree
• Hilbert R-tree
• Packing problem
• Mathematical logic
• Geometry
• Mathematics

Discrete Mathematics and Algorithms Qualifying Exam Junepoints) Consider the following problem: Given n items with sizes a1 , a2 , · · · an all in (0, 1], find a packing in unit size bins that minimizes t

Source URL: stanford.edu

UC Berkeley—CS 170: Efficient Algorithms and Intractable Problems Lecturer: David Wagner Handout 23 May 1, 2003

Source URL: www.cs.berkeley.edu

• NP-complete problems
• Complexity classes
• Bin packing problem
• NP
• Subset sum problem
• Partition problem
• Vertex cover
• Integer
• 3-partition problem
• Theoretical computer science
• Mathematics
• Computational complexity theory

Solving the 0-1 Knapsack Problem with Genetic Algorithms Maya Hristakeva Computer Science Department Simpson College Dipti Shrestha

Source URL: www.assembla.com

• Computational complexity theory
• Crossover
• Knapsack problem
• Fitness proportionate selection
• Mutation
• Chromosome
• Selection
• Bin packing problem
• Population genetics
• Genetic algorithms
• Theoretical computer science
• Applied mathematics

Online Computation with Advice Yuval Emek1 ? , Pierre Fraigniaud2 ?? , Amos Korman2

Source URL: www.liafa.jussieu.fr

• Computational complexity theory
• Applied mathematics
• Competitive analysis
• K-server problem
• Randomized algorithm
• Metrical task system
• Adversary model
• Minimum spanning tree
• Bin packing problem
• Theoretical computer science
• Online algorithms
• Analysis of algorithms

Energy-Aware Service Allocation Damien Borgettoa , Henri Casanovab , Georges Da Costaa , Jean-Marc Piersona b a IRIT, University of Toulouse, Toulouse, France Department of Information and Computer Sciences University of

Source URL: navet.ics.hawaii.edu

• Operations research
• Computational complexity theory
• Convex optimization
• Linear programming
• Greedy algorithm
• Algorithm
• Reduction
• Bin packing problem
• Theoretical computer science
• Mathematics
• Applied mathematics